#include<bits/stdc++.h>
using namespace std;
int n;
int a[1000005];
int fx[3] = { -1,-2,-3 };
int qu[1000000], l = 0;
long long sum = 0;

void dfs(int x)
{

	for (int i = 0; i < 3; i++)
	{
		qu[++l] = fx[i];
		qu[++l] = a[x];
		dfs(x + 1);
		l--;
		l--;
	}
}
void so()
{
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}

	return;
}
int main()
{
	int t = 1;
	//cin>>t;
	while (t--)
	{
		//	so();
		int n;
		cin >> n;
		for (int i = 0; i < n; i++)
		{
			cin >> a[i];
		}
		cout << 11 << endl;
	}

	return 0;
}